Center-based l1–clustering method

Center-based l1-clustering method

In this paper, we consider the l1-clustering problem for a finite data-point set which should be partitioned into k disjoint nonempty subsets. In that case, the objective function does not have to be either convex or differentiable, and generally it may have many local or global minima. Therefore, it becomes a complex global optimization problem. A method of searching for a locally optimal solu...

DEFUZZIFICATION METHOD FOR RANKING FUZZY NUMBERS BASED ON CENTER OF GRAVITY

Ranking fuzzy numbers plays a very important role in decision making and some other fuzzy application systems. Many different methods have been proposed to deal with ranking fuzzy numbers. Constructing ranking indexes based on the centroid of fuzzy numbers is an important case. But some weaknesses are found in these indexes. The purpose of this paper is to give a new ranking index to rank vario...

Analytic Center Cutting-Plane Method

Shadow limit using Renormalization Group method and Center Manifold method

We study a shadow limit (the infinite diffusion coefficient-limit) of a system of ODEs coupled with a semilinear heat equation in a bounded domain with Neumann boundary conditions. In the literature, it was established formally that in the limit, the original semilinear heat equation reduces to an ODE involving the space averages of the solution to the semilinear heat equation and of the nonlin...

An Analytic Center Cutting Plane Method

Semideenite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as nding a point in a nonempty bounded convex body ? in the cone of symmetric positive semideenite matrices. Assume that ? is deened by an oracle, which, for any given m m symmetric matrix ^ Y , either connrms that ^ Y 2 ? or returns a cut, i.e., a symmetric matrix A...